Combining Active Learning and Semi-supervised Learning Using Local and Global Consistency
نویسندگان
چکیده
Semi-supervised learning and active learning are important techniques to solve the shortage of labeled examples. In this paper, a novel active learning algorithm combining semi-supervised Learning with Local and Global Consistency (LLGC) is proposed. It selects the example that can minimize the estimated expected classification risk for labeling. Then, a better classifier can be trained with labeled data and unlabeled data using LLGC. The experiments on two datasets demonstrate the effectiveness of the proposed algorithm.
منابع مشابه
Consistent Image Analogies using Semi-supervised Learning
In this paper we study the following problem: given two source images A and A′, and a target image B, can we learn to synthesize a new image B′ which relates to B in the same way that A′ relates to A? We propose an algorithm which a) uses a semi-supervised component to exploit the fact that the target image B is available apriori, b) uses inference on a Markov Random Field (MRF) to ensure globa...
متن کاملSemi-supervised learning and graph cuts for consensus based medical image segmentation
Medical image segmentation requires consensus ground truth segmentations to be derived from multiple expert annotations. A novel approach is proposed that obtains consensus segmentations from experts using graph cuts (GC) and semi supervised learning (SSL). Popular approaches use iterative Expectation Maximization (EM) to estimate the final annotation and quantify annotator’s performance. Such ...
متن کاملWord Sense Disambiguation by Semi-supervised Learning
In this paper we propose to use a semi-supervised learning algorithm to deal with word sense disambiguation problem. We evaluated a semi-supervised learning algorithm, local and global consistency algorithm, on widely used benchmark corpus for word sense disambiguation. This algorithm yields encouraging experimental results. It achieves better performance than orthodox supervised learning algor...
متن کاملReLISH: Reliable Label Inference via Smoothness Hypothesis
The smoothness hypothesis is critical for graph-based semi-supervised learning. This paper defines local smoothness, based on which a new algorithm, Reliable Label Inference via Smoothness Hypothesis (ReLISH), is proposed. ReLISH has produced smoother labels than some existing methods for both labeled and unlabeled examples. Theoretical analyses demonstrate good stability and generalizability o...
متن کاملLearning with Local and Global Consistency
We consider the general problem of learning from labeled and unlabeled data, which is often called semi-supervised learning or transductive inference. A principled approach to semi-supervised learning is to design a classifying function which is sufficiently smooth with respect to the intrinsic structure collectively revealed by known labeled and unlabeled points. We present a simple algorithm ...
متن کامل